On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere
نویسندگان
چکیده
Let P be a convex polyhedron in R3. The skeleton of P is the graph whose vertices and edges are the vertices and edges of P , respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a (0.999 · π)-spanner. If the vertices are very close to this sphere, then the skeleton is not necessarily a spanner. For the case when the boundary of P is between two concentric spheres of radii 1 and R > 1, and the angles in all faces are at least θ, we prove that the skeleton is a t-spanner, where t depends only on R and θ. One of the ingredients in the proof is a tight upper bound on the geometric dilation of a convex cycle that is contained in an annulus.
منابع مشابه
Research Summary
In my doctoral dissertation (directed by W. P. Thurston) I studied the geometry of convex polyhedra in hyperbolic 3-space H3, and succeeded in producing a geometric characterization of dihedral angles of compact convex polyhedra by reducing the question to a convex isometric embedding problem in the De Sitter sphere, and resolving this problem. In particular, this produced a simple alternative ...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملRigidity of Circle Polyhedra in the 2-sphere and of Hyperideal Polyhedra in Hyperbolic 3-space
We generalize Cauchy’s celebrated theorem on the global rigidity of convex polyhedra in Euclidean 3-space E to the context of circle polyhedra in the 2-sphere S. We prove that any two convex and proper non-unitary c-polyhedra with Möbiuscongruent faces that are consistently oriented are Möbius-congruent. Our result implies the global rigidity of convex inversive distance circle packings in the ...
متن کاملContributing vertices-based Minkowski sum computation of convex polyhedra
Minkowski sum is an important operation. It is used in many domains such as: computer-aided design, robotics, spatial planning, mathematical morphology, and image processing. We propose a novel algorithm, named the Contributing Verticesbased Minkowski Sum (CVMS) algorithm for the computation of the Minkowski sum of convex polyhedra. The CVMS algorithm allows to easily obtain all the facets of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JoCG
دوره 7 شماره
صفحات -
تاریخ انتشار 2016